Sorting out typicality with the inverse moment matrix SOS polynomial

نویسندگان

  • Edouard Pauwels
  • Jean B. Lasserre
چکیده

We study a surprising phenomenon related to the representation of a cloud of data points using polynomials. We start with the previously unnoticed empirical observation that, given a collection (a cloud) of data points, the sublevel sets of a certain distinguished polynomial capture the shape of the cloud very accurately. This distinguished polynomial is a sum-of-squares (SOS) derived in a simple manner from the inverse of the empirical moment matrix. In fact, this SOS polynomial is directly related to orthogonal polynomials and the Christoffel function. This allows to generalize and interpret extremality properties of orthogonal polynomials and to provide a mathematical rationale for the observed phenomenon. Among diverse potential applications, we illustrate the relevance of our results on a network intrusion detection task for which we obtain performances similar to existing dedicated methods reported in the literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inverse scattering problem for the Impulsive Schrodinger equation with a polynomial spectral dependence in the potential

In the present work, under some di¤erentiability conditions on the potential functions , we …rst reduce the inverse scattering problem (ISP) for the polynomial pencil of the Scroedinger equation to the corresponding ISP for the generalized matrix Scrödinger equation . Then ISP will be solved in analogy of the Marchenko method. We aim to establish an e¤ective algorithm for uniquely reconstructin...

متن کامل

Combining SOS and Moment Relaxations with Branch and Bound to Extract Solutions to Global Polynomial Optimization Problems

In this paper, we present a branch and bound algorithm for extracting approximate solutions to Global Polynomial Optimization (GPO) problems with bounded feasible sets. The algorithm is based on a combination of SOS/Moment relaxations and successively bisecting a hyper-rectangle containing the feasible set of the GPO problem. At each iteration, the algorithm makes a comparison between the volum...

متن کامل

SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL

Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

متن کامل

Multivariate Moment Matrices with Zeros in Their Inverse

We investigate and discuss when the inverse of a multivariate truncated moment matrix has zeros in some prescribed entries. We find that the key factor behind that property is a certain conditional triangularity property of orthonormal polynomials associated with the linear functional underlying the moment matrix.

متن کامل

Measures with Zeros in the Inverse of Their Moment Matrix

We investigate and discuss when the inverse of a multivariate truncated moment matrix of a measure μ has zeros in some prescribed entries. We describe precisely which pattern of these zeroes corresponds to independence, namely, the measure having a product structure. A more refined finding is that the key factor forcing a zero entry in this inverse matrix is a certain conditional triangularity ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016